Multitype randomized Reed–Frost epidemics and epidemics upon random graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multitype Randomized Reed–frost Epidemics and Epidemics upon Random Graphs

We consider a multitype epidemic model which is a natural extension of the randomized Reed–Frost epidemic model. The main result is the derivation of an asymptotic Gaussian limit theorem for the final size of the epidemic. The method of proof is simpler, and more direct, than is used for similar results elsewhere in the epidemics literature. In particular, the results are specialized to epidemi...

متن کامل

Multiple Randomised Reed-Frost Epidemics and Epidemics upon Random Graphs

We consider a multitype epidemic model which is a natural extension of the randomised Reed-Frost epidemic model. The main result is the derivation of an asympotic Gaussian limit theorem for the final size of the epidemic. The method of proof is simpler, and more direct, than is used for similar results elsewhere in the epidemics literature. In particular, the results are specialised to epidemic...

متن کامل

Epidemics on random intersection graphs

In this paper we consider a model for the spread of a stochastic SIR (Susceptible → Infectious → Recovered) epidemic on a network of individuals described by a random intersection graph. Individuals belong to a random number of cliques, each of random size, and infection can be transmitted between two individuals if and only if there is a clique they both belong to. Both the clique sizes and th...

متن کامل

SIS epidemics on Triadic Random Graphs

It has been shown in the past that many real-world networks exhibit community structures and non-trivial clustering which comes with the occurrence of a notable number of triangular connections. Yet the influence of such connection patterns on the dynamics of disease transmission is not fully understood. In order to study their role in the context of Susceptible-Infected-Susceptible (SIS) epide...

متن کامل

SIR epidemics on random graphs with a fixed degree sequence

Let ∆ > 1 be a fixed positive integer. For z ∈ R∆+ let Gz be chosen uniformly at random from the collection of graphs on ‖z‖1n vertices that have zin vertices of degree i for i = 1, . . . ,∆. We determine the likely evolution in continuous time of the SIR model for the spread of an infectious disease on Gz, starting from a single infected node. Either the disease halts after infecting only a sm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Applied Probability

سال: 2006

ISSN: 1050-5164

DOI: 10.1214/105051606000000123